A category approach to relation preserving functions in rough set theory
نویسنده
چکیده
Article history: Received 16 November 2013 Received in revised form 10 July 2014 Accepted 11 July 2014 Available online 17 July 2014
منابع مشابه
Topological structure on generalized approximation space related to n-arry relation
Classical structure of rough set theory was first formulated by Z. Pawlak in [6]. The foundation of its object classification is an equivalence binary relation and equivalence classes. The upper and lower approximation operations are two core notions in rough set theory. They can also be seenas a closure operator and an interior operator of the topology induced by an equivalence relation on a u...
متن کاملApplication of Rough Set Theory in Data Mining for Decision Support Systems (DSSs)
Decision support systems (DSSs) are prevalent information systems for decision making in many competitive business environments. In a DSS, decision making process is intimately related to some factors which determine the quality of information systems and their related products. Traditional approaches to data analysis usually cannot be implemented in sophisticated Companies, where managers ne...
متن کاملT-Rough Sets Based on the Lattices
The aim of this paper is to introduce and study set- valued homomorphism on lattices and T-rough lattice with respect to a sublattice. This paper deals with T-rough set approach on the lattice theory. The result of this study contributes to, T-rough fuzzy set and approximation theory and proved in several papers. Keywords: approximation space; lattice; prime ideal; rough ideal; T-rough set; set...
متن کاملA New Approach for Knowledge Based Systems Reduction using Rough Sets Theory (RESEARCH NOTE)
Problem of knowledge analysis for decision support system is the most difficult task of information systems. This paper presents a new approach based on notions of mathematical theory of Rough Sets to solve this problem. Using these concepts a systematic approach has been developed to reduce the size of decision database and extract reduced rules set from vague and uncertain data. The method ha...
متن کاملALGEBRAIC GENERATIONS OF SOME FUZZY POWERSET OPERATORS
In this paper, let $L$ be a completeresiduated lattice, and let {bf Set} denote the category of setsand mappings, $LF$-{bf Pos} denote the category of $LF$-posets and$LF$-monotone mappings, and $LF$-{bf CSLat}$(sqcup)$, $LF$-{bfCSLat}$(sqcap)$ denote the category of $LF$-completelattices and $LF$-join-preserving mappings and the category of$LF$-complete lattices and $LF$-meet-preserving mapping...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Approx. Reasoning
دوره 56 شماره
صفحات -
تاریخ انتشار 2015